64 research outputs found
Matchability of heterogeneous networks pairs
We consider the problem of graph matchability in non-identically distributed networks. In a general class of edge-independent networks, we demonstrate that graph matchability is almost surely lost when matching the networks directly, and is almost perfectly recovered when first centering the networks using Universal Singular Value Thresholding before matching. These theoretical results are then demonstrated in both real and synthetic simulation settings. We also recover analogous core-matchability results in a very general core-junk network model, wherein some vertices do not correspond between the graph pair.First author draf
Logarithmic Representability of Integers as k-Sums
A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each
element in {0,1,...,kn} can be written as a k-sum of elements of A in at least
one way. Seeking multiple representations as k-sums, and given any function
phi(n), with lim(phi(n))=infinity, we say that A is a truncated
phi(n)-representative k-basis for [n] if for each j in [alpha n, (k-alpha)n]
the number of ways that j can be represented as a k-sum of elements of A_{k,n}
is Theta(phi(n)). In this paper, we follow tradition and focus on the case
phi(n)=log n, and show that a randomly selected set in an appropriate
probability space is a truncated log-representative basis with probability that
tends to one as n tends to infinity. This result is a finite version of a
result proved by Erdos (1956) and extended by Erdos and Tetali (1990).Comment: 18 page
Matched filters for noisy induced subgraph detection
First author draftWe consider the problem of finding the vertex correspondence between two graphs with different number of vertices where the smaller graph is still potentially large. We propose a solution to this problem via a graph matching matched filter: padding the smaller graph in different ways and then using graph matching methods to align it to the larger network. Under a statistical model for correlated pairs of graphs, which yields a noisy copy of the small graph within the larger graph, the resulting optimization problem can be guaranteed to recover the true vertex correspondence between the networks, though there are currently no efficient algorithms for solving this problem. We consider an approach that exploits a partially known correspondence and show via varied simulations and applications to the Drosophila connectome that in practice this approach can achieve good performance.https://arxiv.org/abs/1803.02423https://arxiv.org/abs/1803.0242
- …